#include<iostream>
#include<assert.h>
#include<set>
#include<map>
#include<string>
using namespace std;
#include"AVLTree.h"

int main()
{
	int a[] = { 8, 3, 1, 10, 6, 4, 7, 14, 13 };
	//int a[] = { 16, 3, 7, 11, 9, 26, 18, 14, 15 };
	//int a[] = { 4, 2, 6, 1, 3, 5, 15, 7, 16, 14 };
		AVLTree<int, int> t;
		for (auto e : a)
		{

			t.Insert(make_pair(e, e));
			cout <<"insert: " << e << ": " << t.IsBalance() << endl;
		}
	
		t.Inorder();
	
		
	return 0;
}